Ant Colony Optimisation for Planning Safe Escape Routes

نویسندگان

  • Morten Goodwin Olsen
  • Ole-Christoffer Granmo
  • Jaziar Radianti
  • Parvaneh Sarshar
  • Sondre Glimsdal
چکیده

An emergency requiring evacuation is a chaotic event filled with uncertainties both for the people affected and rescuers. The evacuees are often left to themselves for navigation to the escape area. The chaotic situation increases when a predefined escape route is blocked by a hazard, and there is a need to re-think which escape route is safest. This paper addresses automatically finding the safest escape route in emergency situations in large buildings or ships with imperfect knowledge of the hazards. The proposed solution, based on Ant Colony Optimisation, suggests a near optimal escape plan for every affected person — considering both dynamic spread of hazards and congestion avoidance. The solution can be used both on an individual bases, such as from a personal smart phone of one of the evacuees, or from a remote location by emergency personnel trying to assist large groups.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Objective Optimization for Massive Pedestrian Evacuation Using Ant Colony Algorithm

Evacuation route planning is one of the most crucial tasks for solving massive evacuation problem. In large public places, pedestrians should be transferred to safe areas when nature or man-made accidents happen. A multi-objective ant colony algorithm for massive pedestrian evacuation is presented in this paper. In the algorithm, three objectives, total evacuation time of all evacuees, total ro...

متن کامل

Optimization of Route Planning using Simulated Ant Agent System

This research presents an optimization technique for route planning using simulated ant agents for dynamic online route planning and optimization of the route. It addresses the issues involved during route planning in dynamic and unknown environments cluttered with obstacles and objects. A simulated ant agent system (SAAS) is proposed using modified ant colony optimization algorithm for dealing...

متن کامل

Ant Evolutionary Algorithms for Molecular Conformation Problems

Ant based optimisation methods were invented by Marco Dorigo and so far have been used almost entirely for order-based problems (finding routes in communication nets or manufacturing scheduling task orderings), the basic ant methods are not apparently suitable for searching in Real-valued spaces or in combinatorial but non-ordered spaces. The aim is to look into various ways of extending the an...

متن کامل

Navdec Decision Support System to Avoid Collision and Distress in Sea Navigation

This paper proposes an advanced navigation decision support system (NAVDEC) mainly to avoid the collision among two or more vessels in sea. More commonly the faults can be occurred by the mistakes of human where it can be avoided by the decision support system. Decision can be taken by the navigator in critical situations with the help of the gathered information from different identification a...

متن کامل

MAGISTERARBEIT An Ant Colony Optimisation Algorithm for the Bounded Diameter Minimum Spanning Tree Problem

This master thesis presents an ant colony optimisation algorithm for the bounded diameter minimum spanning tree problem, a NP-hard combinatorial optimisation problem with various application fields, e.g. when considering certain aspects of quality in communication network design. The algorithm is extended with local optimisation in terms of a variable neighbourhood descent algorithm based on fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013